Applying ACL2 to the Formalization of Algebraic Topology: Simplicial Polynomials
نویسندگان
چکیده
L. Lambán et al. () ACL2 and Algebraic Topology 1 / 23 Introduction Kenzo symbolic computation system: a Common Lisp program devoted to Algebraic (Simplicial) Topology. ◮ A research tool: used to obtain relevant results in the field, neither confirmed nor refuted by any other means. The following question makes sense: Is it Kenzo correct? Our goal: we want to formally prove correcteness properties of the algorithms implemented in Kenzo Since Kenzo is coded in Common Lisp, ACL2 seems a natural candidate for this task ◮ Is it first-order enough to reason about algebraic topology? L. Lambán et al. () ACL2 and Algebraic Topology 2 / 23
منابع مشابه
Proving with ACL2 the Correctness of Simplicial Sets in the Kenzo System
Kenzo is a Common Lisp system devoted to Algebraic Topology. Although Kenzo uses higher-order functional programming intensively, we show in this paper how the theorem prover ACL2 can be used to prove the correctness of first order fragments of Kenzo. More concretely, we report on the verification in ACL2 of the implementation of simplicial sets. By means of a generic instantiation mechanism, w...
متن کاملA certified module of Simplicial Complexes for the Kenzo system
In the field of Intelligent Information Processing, mechanized reasoning systems provide a chance of increasing the reliability of software systems, namely Computer Algebra Systems. This paper is devoted to a concrete case of this topic. The notion of simplicial complex, see [7], is the most elementary method to settle a connection between common “general” topology and homological algebra. The ...
متن کاملACL2 Verification of Simplicial Degeneracy Programs in the Kenzo System
Kenzo is a Computer Algebra system devoted to Algebraic Topology, and written in the Common Lisp programming language. It is a descendant of a previous system called EAT (for Effective Algebraic Topology). Kenzo shows a much better performance than EAT due, among other reasons, to a smart encoding of degeneracy lists as integers. In this paper, we give a complete automated proof of the correctn...
متن کاملIncidence Simplicial Matrices Formalized in Coq/SSReflect
Simplicial complexes are at the heart of Computational Algebraic Topology, since they give a concrete, combinatorial description of otherwise rather abstract objects which makes many important topological computations possible. The whole theory has many applications such as coding theory, robotics or digital image analysis. In this paper we present a formalization in the COQ theorem prover of s...
متن کاملFrom Concurrency to Algebraic Topology
This paper is a survey of the new notions and results scattered in [13,11,12]. However the speculations of Section 5 and Section 6 are new. Starting from a formalization of higher dimensional automata (HDA) by strict globular ω-categories, the construction of a diagram of simplicial sets over the three-object small category − ← gl → + is exposed. Some of the properties discovered so far on the ...
متن کامل